Vertex-magic total labeling of a graph by distributed constraint solving in the mozart system
Identifieur interne :
000128 ( PascalFrancis/Corpus );
précédent :
000127;
suivant :
000129
Vertex-magic total labeling of a graph by distributed constraint solving in the mozart system
Auteurs : Adam Meissner ;
Krzysztof ZwierzynskiSource :
-
Lecture notes in computer science
RBID : Pascal:07-0471617
Descripteurs français
English descriptors
Abstract
In this paper we present how a problem of a vertex-magic total labeling of a graph may be expressed in terms of constraint programming over finite domains (CP(FD)) in the Mozart system. A program representing the problem is easily transformable into a parallel version, which can be executed on distributed machines. We describe the results of experiments for estimating a speedup, a work granularity and an overhead of a parallel version in comparison with sequential computations.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A05 | | | | @2 3911 |
|---|
| A08 | 01 | 1 | ENG | @1 Vertex-magic total labeling of a graph by distributed constraint solving in the mozart system |
|---|
| A09 | 01 | 1 | ENG | @1 Parallel processing and applied mathematics : 6th International Conference, PPAM 2005, Poznań, Poland, September 11-14, 2005 : revised selected papers |
|---|
| A11 | 01 | 1 | | @1 MEISSNER (Adam) |
|---|
| A11 | 02 | 1 | | @1 ZWIERZYNSKI (Krzysztof) |
|---|
| A14 | 01 | | | @1 Institute of Control and Information Engineering, Poznań University of Technology, pl. M. Sklodowskiej-Curie 5 @2 60-965 Poznań @3 POL @Z 1 aut. @Z 2 aut. |
|---|
| A20 | | | | @1 952-959 |
|---|
| A21 | | | | @1 2006 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-34141-2 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000153603741150 |
|---|
| A44 | | | | @0 0000 @1 © 2007 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 7 ref. |
|---|
| A47 | 01 | 1 | | @0 07-0471617 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 2 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| A66 | 02 | | | @0 USA |
|---|
| C01 | 01 | | ENG | @0 In this paper we present how a problem of a vertex-magic total labeling of a graph may be expressed in terms of constraint programming over finite domains (CP(FD)) in the Mozart system. A program representing the problem is easily transformable into a parallel version, which can be executed on distributed machines. We describe the results of experiments for estimating a speedup, a work granularity and an overhead of a parallel version in comparison with sequential computations. |
|---|
| C02 | 01 | X | | @0 001D02B04 |
|---|
| C03 | 01 | X | FRE | @0 Calcul réparti @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Distributed computing @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Cálculo repartido @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Algorithme parallèle @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Parallel algorithm @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Algoritmo paralelo @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Grosseur grain @5 18 |
|---|
| C03 | 03 | X | ENG | @0 Grain size @5 18 |
|---|
| C03 | 03 | X | SPA | @0 Grosor grano @5 18 |
|---|
| C03 | 04 | X | FRE | @0 Satisfaction contrainte @5 23 |
|---|
| C03 | 04 | X | ENG | @0 Constraint satisfaction @5 23 |
|---|
| C03 | 04 | X | SPA | @0 Satisfaccion restricción @5 23 |
|---|
| C03 | 05 | X | FRE | @0 Optimisation sous contrainte @5 24 |
|---|
| C03 | 05 | X | ENG | @0 Constrained optimization @5 24 |
|---|
| C03 | 05 | X | SPA | @0 Optimización con restricción @5 24 |
|---|
| C03 | 06 | X | FRE | @0 Calcul séquentiel @4 CD @5 96 |
|---|
| C03 | 06 | X | ENG | @0 Sequential computation @4 CD @5 96 |
|---|
| C03 | 06 | X | SPA | @0 Càlculo secuencial @4 CD @5 96 |
|---|
| N21 | | | | @1 309 |
|---|
| N44 | 01 | | | @1 OTO |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 PPAM 2005 @2 6 @3 Poznan @4 2005 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 07-0471617 INIST |
|---|
| ET : | Vertex-magic total labeling of a graph by distributed constraint solving in the mozart system |
|---|
| AU : | MEISSNER (Adam); ZWIERZYNSKI (Krzysztof) |
|---|
| AF : | Institute of Control and Information Engineering, Poznań University of Technology, pl. M. Sklodowskiej-Curie 5/60-965 Poznań/Pologne (1 aut., 2 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; Allemagne; Da. 2006; Vol. 3911; Pp. 952-959; Bibl. 7 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | In this paper we present how a problem of a vertex-magic total labeling of a graph may be expressed in terms of constraint programming over finite domains (CP(FD)) in the Mozart system. A program representing the problem is easily transformable into a parallel version, which can be executed on distributed machines. We describe the results of experiments for estimating a speedup, a work granularity and an overhead of a parallel version in comparison with sequential computations. |
|---|
| CC : | 001D02B04 |
|---|
| FD : | Calcul réparti; Algorithme parallèle; Grosseur grain; Satisfaction contrainte; Optimisation sous contrainte; Calcul séquentiel |
|---|
| ED : | Distributed computing; Parallel algorithm; Grain size; Constraint satisfaction; Constrained optimization; Sequential computation |
|---|
| SD : | Cálculo repartido; Algoritmo paralelo; Grosor grano; Satisfaccion restricción; Optimización con restricción; Càlculo secuencial |
|---|
| LO : | INIST-16343.354000153603741150 |
|---|
| ID : | 07-0471617 |
|---|
Links to Exploration step
Pascal:07-0471617
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Vertex-magic total labeling of a graph by distributed constraint solving in the mozart system</title>
<author><name sortKey="Meissner, Adam" sort="Meissner, Adam" uniqKey="Meissner A" first="Adam" last="Meissner">Adam Meissner</name>
<affiliation><inist:fA14 i1="01"><s1>Institute of Control and Information Engineering, Poznań University of Technology, pl. M. Sklodowskiej-Curie 5</s1>
<s2>60-965 Poznań</s2>
<s3>POL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Zwierzynski, Krzysztof" sort="Zwierzynski, Krzysztof" uniqKey="Zwierzynski K" first="Krzysztof" last="Zwierzynski">Krzysztof Zwierzynski</name>
<affiliation><inist:fA14 i1="01"><s1>Institute of Control and Information Engineering, Poznań University of Technology, pl. M. Sklodowskiej-Curie 5</s1>
<s2>60-965 Poznań</s2>
<s3>POL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">07-0471617</idno>
<date when="2006">2006</date>
<idno type="stanalyst">PASCAL 07-0471617 INIST</idno>
<idno type="RBID">Pascal:07-0471617</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000128</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Vertex-magic total labeling of a graph by distributed constraint solving in the mozart system</title>
<author><name sortKey="Meissner, Adam" sort="Meissner, Adam" uniqKey="Meissner A" first="Adam" last="Meissner">Adam Meissner</name>
<affiliation><inist:fA14 i1="01"><s1>Institute of Control and Information Engineering, Poznań University of Technology, pl. M. Sklodowskiej-Curie 5</s1>
<s2>60-965 Poznań</s2>
<s3>POL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Zwierzynski, Krzysztof" sort="Zwierzynski, Krzysztof" uniqKey="Zwierzynski K" first="Krzysztof" last="Zwierzynski">Krzysztof Zwierzynski</name>
<affiliation><inist:fA14 i1="01"><s1>Institute of Control and Information Engineering, Poznań University of Technology, pl. M. Sklodowskiej-Curie 5</s1>
<s2>60-965 Poznań</s2>
<s3>POL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
</series><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Constrained optimization</term>
<term>Constraint satisfaction</term>
<term>Distributed computing</term>
<term>Grain size</term>
<term>Parallel algorithm</term>
<term>Sequential computation</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Calcul réparti</term>
<term>Algorithme parallèle</term>
<term>Grosseur grain</term>
<term>Satisfaction contrainte</term>
<term>Optimisation sous contrainte</term>
<term>Calcul séquentiel</term>
</keywords><front><div type="abstract" xml:lang="en">In this paper we present how a problem of a vertex-magic total labeling of a graph may be expressed in terms of constraint programming over finite domains (CP(FD)) in the Mozart system. A program representing the problem is easily transformable into a parallel version, which can be executed on distributed machines. We describe the results of experiments for estimating a speedup, a work granularity and an overhead of a parallel version in comparison with sequential computations.</div>
</front><inist><standard h6="B"><pA><fA05><s2>3911</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Vertex-magic total labeling of a graph by distributed constraint solving in the mozart system</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Parallel processing and applied mathematics : 6th International Conference, PPAM 2005, Poznań, Poland, September 11-14, 2005 : revised selected papers</s1>
</fA09><fA11 i1="01" i2="1"><s1>MEISSNER (Adam)</s1>
</fA11><fA11 i1="02" i2="1"><s1>ZWIERZYNSKI (Krzysztof)</s1>
</fA11><fA14 i1="01"><s1>Institute of Control and Information Engineering, Poznań University of Technology, pl. M. Sklodowskiej-Curie 5</s1>
<s2>60-965 Poznań</s2>
<s3>POL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14><fA20><s1>952-959</s1>
</fA20><fA21><s1>2006</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-34141-2</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000153603741150</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2007 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>7 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>07-0471617</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="2"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fA66 i1="02"><s0>USA</s0>
</fA66><fC01 i1="01" l="ENG"><s0>In this paper we present how a problem of a vertex-magic total labeling of a graph may be expressed in terms of constraint programming over finite domains (CP(FD)) in the Mozart system. A program representing the problem is easily transformable into a parallel version, which can be executed on distributed machines. We describe the results of experiments for estimating a speedup, a work granularity and an overhead of a parallel version in comparison with sequential computations.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02B04</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Calcul réparti</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Distributed computing</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Cálculo repartido</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Algorithme parallèle</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Parallel algorithm</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Algoritmo paralelo</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Grosseur grain</s0>
<s5>18</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Grain size</s0>
<s5>18</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Grosor grano</s0>
<s5>18</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Satisfaction contrainte</s0>
<s5>23</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Constraint satisfaction</s0>
<s5>23</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Satisfaccion restricción</s0>
<s5>23</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Optimisation sous contrainte</s0>
<s5>24</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Constrained optimization</s0>
<s5>24</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Optimización con restricción</s0>
<s5>24</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Calcul séquentiel</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Sequential computation</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Càlculo secuencial</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fN21><s1>309</s1>
</fN21><fN44 i1="01"><s1>OTO</s1>
</fN44><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>PPAM 2005</s1>
<s2>6</s2>
<s3>Poznan</s3>
<s4>2005</s4>
</fA30><server><NO>PASCAL 07-0471617 INIST</NO>
<ET>Vertex-magic total labeling of a graph by distributed constraint solving in the mozart system</ET>
<AU>MEISSNER (Adam); ZWIERZYNSKI (Krzysztof)</AU>
<AF>Institute of Control and Information Engineering, Poznań University of Technology, pl. M. Sklodowskiej-Curie 5/60-965 Poznań/Pologne (1 aut., 2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; Allemagne; Da. 2006; Vol. 3911; Pp. 952-959; Bibl. 7 ref.</SO>
<LA>Anglais</LA>
<EA>In this paper we present how a problem of a vertex-magic total labeling of a graph may be expressed in terms of constraint programming over finite domains (CP(FD)) in the Mozart system. A program representing the problem is easily transformable into a parallel version, which can be executed on distributed machines. We describe the results of experiments for estimating a speedup, a work granularity and an overhead of a parallel version in comparison with sequential computations.</EA>
<CC>001D02B04</CC>
<FD>Calcul réparti; Algorithme parallèle; Grosseur grain; Satisfaction contrainte; Optimisation sous contrainte; Calcul séquentiel</FD>
<ED>Distributed computing; Parallel algorithm; Grain size; Constraint satisfaction; Constrained optimization; Sequential computation</ED>
<SD>Cálculo repartido; Algoritmo paralelo; Grosor grano; Satisfaccion restricción; Optimización con restricción; Càlculo secuencial</SD>
<LO>INIST-16343.354000153603741150</LO>
<ID>07-0471617</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000128 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000128 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:07-0471617
|texte= Vertex-magic total labeling of a graph by distributed constraint solving in the mozart system
}}
| This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Tue Feb 7 15:40:35 2023 |  |
